INTERNSHIP REPORT Supporting additional equational theories in Tamarin
نویسندگان
چکیده
منابع مشابه
The TAMARIN Prover for the Symbolic Analysis of Security Protocols
The Tamarin prover supports the automated, unbounded, symbolic analysis of security protocols. It features expressive languages for specifying protocols, adversary models, and properties, and support for efficient deduction and equational reasoning. We provide an overview of the tool and its applications.
متن کاملUniication in the Union of Disjoint Equational Theories: Combining Decision Procedures Uniication in the Union of Disjoint Equational Theories: Combining Decision Procedures
Most of the work on the combination of uniication algorithms for the union of disjoint equational theories has been restricted to algorithms which compute nite complete sets of uniiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms which just decide solvability of uniication problems without computing uniiers. In this paper we des...
متن کاملDeciding the Word Problem in the Union of Equational Theories
The main contribution of this report is a new method for combining decision procedures for the word problem in equational theories. In contrast to previous methods, it is based on transformation rules, and also applies to theories sharing \constructors." In addition, we show that|contrary to a common belief|the Nelson-Oppen combination method cannot be used to combine decision procedures for th...
متن کاملUni cation in Extensions of Shallow Equational Theories
We show that uni cation in certain extensions of shallow equational theories is decidable Our extensions generalize the known classes of shallow or standard equational theories In order to prove de cidability of uni cation in the extensions a class of Horn clause sets called sorted shallow equational theories is introduced This class is a natural extension of tree automata with equality constra...
متن کاملUniication in Extensions of Shallow Equational Theories
We show that uniication in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove de-cidability of uniication in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016